Generation and synchronous tree-adjoining grammars
نویسندگان
چکیده
منابع مشابه
Synchronous Tree-Adjoining Grammars
The unique properties of tree-adjoining grammars (TAG) present a challenge for the application of TAGs beyond the limited confines of syntax, for instance, to the task of semantic interpretation or automatic translation of natural language. We present a variant of TAGs, called synchronous TAGs, which characterize correspondences between languages. The formalism's intended usage is to relate exp...
متن کاملTree Parsing with Synchronous Tree-Adjoining Grammars
Restricting the input or the output of a grammar-induced translation to a given set of trees plays an important role in statistical machine translation. The problem for practical systems is to find a compact (and in particular, finite) representation of said restriction. For the class of synchronous treeadjoining grammars, partial solutions to this problem have been described, some being restri...
متن کاملA Tree Transducer Model for Synchronous Tree-Adjoining Grammars
A characterization of the expressive power of synchronous tree-adjoining grammars (STAGs) in terms of tree transducers (or equivalently, synchronous tree substitution grammars) is developed. Essentially, a STAG corresponds to an extended tree transducer that uses explicit substitution in both the input and output. This characterization allows the easy integration of STAG into toolkits for exten...
متن کاملIncremental Parser Generation for Tree Adjoining Grammars
This paper describes the incremental generation of parse tables for the LRtype parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modi cations to the input grammar by updating the parser generated so far. In this paper, a lazy generation of LR-type parsers for TALs is de ned in which parse tables are created by need while parsing. We then describe an incremental parser ...
متن کاملUnidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars
Synchronous tree-adjoining grammars have been given two types of semantics: one based on bimorphisms and one based on synchronous derivations, in both of which the input and output trees are constructed synchronously. We introduce a third type of semantics that is based on unidirectional derivations. It derives output trees based on a given input tree and thus marks a first step towards conditi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Intelligence
سال: 1991
ISSN: 0824-7935,1467-8640
DOI: 10.1111/j.1467-8640.1991.tb00396.x